Particle computation: complexity, algorithms, and logic
نویسندگان
چکیده
منابع مشابه
Possibilistic Logic: Complexity and Algorithms
Possibilistic logic is a logic for reasoning with uncertain and partially inconsistent knowledge bases. Its standard version consists in ranking propositional formulas according to their certainty or priority level, by assigning them lower bounds of necessity values. We give a survey of automated deduction techniques for standard possibilistic logic, together with complexity results. We focus o...
متن کاملPreface: Algorithms, complexity and models of computation
This Special Issue arises from the conference Theory and Applications of Models of Computation 2007, held at Fudan University, Shanghai in May 2007. Theory and Applications of Models of Computation (TAMC) is an international conference series with an interdisciplinary character, bringing together researchers working in computer science, mathematics and the physical sciences. This interdisciplin...
متن کاملComplexity Analysis of Algorithms in Algebraic Computation
Numerical computations with real algebraic numbers require algorithms for approximating and isolating real roots of polynomials. A classical choice for root approximation is Newton’s method. For an analytic function on a Banach space, Smale introduced the concept of approximate zeros, i.e., points from which Newton’s method for the function converges quadratically. To identify these approximate...
متن کاملQuirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic
The satisfiability problem of the branching time logic CTL is studied in terms of computational complexity. Tight upper and lower bounds are provided for each temporal operator fragment. In parallel the minimal model size is studied with a suitable notion of minimality. Thirdly, flat CTL is investigated, i.e., formulas with very low temporal operator nesting depth. A sharp dichotomy is shown in...
متن کاملComputation in Logic and Logic in Computation
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable; so is the theory of multiplication in all those domains. By Gödel’s Incompleteness Theorem the theory of addition and multiplication is undecidable in the domains of N, Z and Q; though Tarski proved that this theory is decidable in the domains of R and C. The theory of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2017
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-017-9666-6